Semantic Minimization of 3-Valued Propositional Formulae
نویسندگان
چکیده
Abstract This paper presents an algorithm for a non-standard logicminimization problem that arises in -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use -valued logic. An answer of or provides precise (definite) information; an answer of provides imprecise (indefinite) information. By replacing a formula with a “better” formula , we may improve the precision of the answers obtained. In this paper, we give an algorithm that always produces a formula that is “best” (in a certain well-defined sense).
منابع مشابه
Bounded Model Checking for Partial Kripke Structures
Partial Kripke structures model incomplete state spaces with unknown parts. The evaluation of temporal logic formulae on partial Kripke structures is thus based on three-valued interpretations; the additional truth value ⊥ stands for “unknown whether property true or false”. There are existing model checking algorithms as well as tools employing this three-valued interpretation. In this paper w...
متن کاملMulti-ary Α-semantic Resolution Automated Reasoning Based on a Lattice-valued Proposition Logic Lp(x)
This paper focuses on multi-ary α-semantic resolution automated reasoning method based on multi-ary α-resolution principle for lattice-valued propositional logic LP(X) with truth-value in lattice implication algebras. The definitions of the multi-ary α-semantic resolution and multi-ary α-semantic resolution deduction in lattice-valued propositional logic LP(X) are given, respectively, and the s...
متن کاملA Domain Reasoner for Propositional Logic
An important topic in courses in propositional logic is rewriting propositional formulae with standard equivalences. This paper analyses what kind of feedback is offered by the various learning environments for rewriting propositional logic formulae, and discusses how we can provide these kinds of feedback in a learning environment. To give feedback and feed forward, we define solution strategi...
متن کاملTHE DEGREE OF COMPLETENESS OF THE m-VALUED LUKASIEWICZ PROPOSITIONAL CALCULUS CORRECTION AND ADDENDUM
P,,...,PnVQ. If, for this formalisation, the value of n is bounded above and the greatest possible value of n is a then the formalisation is saidf to have degree of completeness a+1. Let us denote by C(m) the degree of completeness of a formalisation of the w-valued Lukasiewicz propositional calculus of the type considered in the previous paper with the above title [3]. In that paper it was sta...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کامل